Capacity Random Forest for Correlative Multiple Criteria Decision Pattern Learning

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SHAPLEY FUNCTION BASED INTERVAL-VALUED INTUITIONISTIC FUZZY VIKOR TECHNIQUE FOR CORRELATIVE MULTI-CRITERIA DECISION MAKING PROBLEMS

Interval-valued intuitionistic fuzzy set (IVIFS) has developed to cope with the uncertainty of imprecise human thinking. In the present communication, new entropy and similarity measures for IVIFSs based on exponential function are presented and compared with the existing measures. Numerical results reveal that the proposed information measures attain the higher association with the existing me...

متن کامل

Random-weight Generation in Multiple Criteria Decision Models

In this paper, we consider generating random uniformly-distributed weights for the simulation of additive p-criteria decision models. First we review several approaches for generating random weights, and show that some obvious approaches do not work well at all. Then, we consider several procedures for generating weights that satisfy general linear constraints. Instead of solving many small lin...

متن کامل

APPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING

In this paper, an interesting and easy method to solve the multi-dimensional  knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA).  Finally, ite...

متن کامل

Random Hinge Forest for Differentiable Learning

We propose random hinge forests, a simple, efficient, and novel variant of decision forests. Importantly, random hinge forests can be readily incorporated as a general component within arbitrary computation graphs that are optimized endto-end with stochastic gradient descent or variants thereof. We derive random hinge forest and ferns, focusing on their sparse and efficient nature, their min-ma...

متن کامل

Evolving Random Forest for Preference Learning

This paper introduces a novel approach for pairwise preference learning through a combination of an evolutionary method and random forest. Grammatical evolution is used to describe the structure of the trees in the Random Forest (RF) and to handle the process of evolution. Evolved random forests are evaluated based on their efficiency in predicting reported preferences. The combination of these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2020

ISSN: 2227-7390

DOI: 10.3390/math8081372